Multi-type Display Calculus for Semi De Morgan Logic
نویسندگان
چکیده
Semi De Morgan algebras form a variety of normal distributive lattice expansions [7] introduced by H.P. Sankappanavar [16] as a common abstraction of De Morgan algebras and distributive pseudocomplemented lattices. A fully selfextensional logic SDM naturally arises from semi De Morgan algebras, which has been studied from a duality-theoretic perspective [13], from the perspective of canonical extensions [15], and from a proof-theoretic perspective [14]. Related to the proof theoretic perspective, the G3-style sequent calculus introduced in [14] is shown to be cut-free. However, the proof of cut elimination is quite involved, due to the fact that, along with the standard introduction rules for conjunction and disjunction, this calculus includes also introduction rules under the scope of structural connectives. These difficulties can be explained by the fact that the axiomatization of SDM is not analytic inductive in the sense of [10, Definition 55], due to the presence of the following axioms
منابع مشابه
Dually quasi-De Morgan Stone semi-Heyting algebras I. Regularity
This paper is the first of a two part series. In this paper, we first prove that the variety of dually quasi-De Morgan Stone semi-Heyting algebras of level 1 satisfies the strongly blended $lor$-De Morgan law introduced in cite{Sa12}. Then, using this result and the results of cite{Sa12}, we prove our main result which gives an explicit description of simple algebras(=subdirectly irreducibles) ...
متن کاملDually quasi-De Morgan Stone semi-Heyting algebras II. Regularity
This paper is the second of a two part series. In this Part, we prove, using the description of simples obtained in Part I, that the variety $mathbf{RDQDStSH_1}$ of regular dually quasi-De Morgan Stone semi-Heyting algebras of level 1 is the join of the variety generated by the twenty 3-element $mathbf{RDQDStSH_1}$-chains and the variety of dually quasi-De Morgan Boolean semi-Heyting algebras--...
متن کاملMulti-type display calculus for propositional dynamic logic
We introduce a multi-type display calculus for Propositional Dynamic Logic (PDL). This calculus is complete w.r.t. PDL, and enjoys Belnap-style cut-elimination and subformula property.
متن کاملMulti-type display calculus for dynamic epistemic logic
In the present paper, we introduce a multi-type display calculus for dynamic epistemic logic, which we refer to as Dynamic Calculus. The displayapproach is suitable to modularly chart the space of dynamic epistemic logics on weaker-than-classical propositional base. The presence of types endows the language of the Dynamic Calculus with additional expressivity, allows for a smooth proof-theoreti...
متن کاملThe dagger lambda calculus
We present a novel lambda calculus that casts the categorical approach to the study of quantum protocols [4] into the rich and well established tradition of type theory. Our construction extends the linear typed lambda calculus [6] with a linear negation [1] of ”trivialised” De Morgan duality [5]. Reduction is realised through explicit substitution, based on a symmetric notion of binding of glo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017